CAD Adjacency Computation Using Validated Numerics
نویسنده
چکیده
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and topological properties e.g. homology groups. Other applications include visualization and path planning. Our algorithm determines cell adjacency information using validated numerical methods similar to those used in CAD construction, thus computing CAD with adjacency information in time comparable to that of computing CAD without adjacency information. We report on implementation of the algorithm and present empirical data.
منابع مشابه
A unified approach to floorplan sizing and enumeration
Abstrecr-Given a sliceable floorplan and cell sizes, Otten and Stockmeyer [12], [13] presented an algorithm to find an optimal implementation for each cell. We consider a generalized optimal sizing problem on a set of slicing trees related to an adjacency graph. For computation efficiency, we combine the tree enumeration and sizing procedures in a unified algorithm where floorplan trees and siz...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Evaluation of different approaches in 3D curved kernel for arrangements of quadrics
Within the context of the ACS project we have investigated two approaches towards the arrangements of quadrics. The first approach, which is presented in ACS-TR-241402-01, computes the adjacency graph of the arrangement and is based on an exact parameterization of the appearing intersection curves. The second approach, which is presented in ACS-TR-241402-02, computes the arrangement on each qua...
متن کاملFixed points of a destabilized Kuramoto-Sivashinsky equation
We consider the family of destabilized Kuramoto-Sivashinsky equations in one spatial dimension ut + νuxxxx + βuxx + γuux = αu for α,ν ≥ 0 and β ,γ ∈ R. For certain parameter values, shock-like stationary solutions have been numerically observed. In this work we verify the existence of several such solutions using the framework of self-consistent bounds and validated numerics.
متن کاملA reliable and efficient procedure for oscillator PPV computation, with phase noise macromodeling applications
The main effort in oscillator phase noise calculation and macromodeling lies in computing a vector function called the perturbation projection vector (PPV). Current techniques for PPV calculation use time-domain numerics to generate the system’s monodromy matrix, followed by full or partial eigenanalysis. We present superior methods that find the PPV using only a single linear solution of the o...
متن کاملValidated Numerics for Pedestrians
The aim of this paper is to give a very brief introduction to the emerging area of validated numerics. This is a rapidly growing field of research faced with the challenge of interfacing computer science and pure mathematics. Most validated numerics is based on interval analysis, which allows its users to account for both rounding and discretization errors in computer-aided proofs. We will illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017